Semantics for Counterpossibles

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

God and counterpossibles

In this paper I critically examine Brian Leftow’s attempt to construct a theistic semantics for counterpossibles, one that can be used to make sense of the fact that propositions, which exist necessarily, nevertheless depend on God as their cause. I argue that the impressive theoretical framework erected by Leftow cannot guarantee an asymmetrical dependence of propositions on God, and ultimatel...

متن کامل

Hierarchical Fuzzy Clustering Semantics (HFCS) in Web Document for Discovering Latent Semantics

This paper discusses about the future of the World Wide Web development, called Semantic Web. Undoubtedly, Web service is one of the most important services on the Internet, which has had the greatest impact on the generalization of the Internet in human societies. Internet penetration has been an effective factor in growth of the volume of information on the Web. The massive growth of informat...

متن کامل

Functorial semantics of topological theories

Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...

متن کامل

Which Semantics for Neighbourhood Semantics?

In this article we discuss two alternative proposals for neighbourhood semantics (which we call strict and loose neighbourhood semantics, N= and N⊆ respectively) that have been previously introduced in the literature. Our main tools are suitable notions of bisimulation. While an elegant notion of bisimulation exists forN⊆, the required bisimulation for N= is rather involved. We propose a simple...

متن کامل

Combinatorial Semantics: Semantics for Frequent Validity

In ordinary rst order logic, a valid inference in a language L is one in which the conclusion is true in every model of the language in which the premises are true. To accommodate inductive/uncertain/probabilistic/nonmonotonic inference, we weaken that demand to the demand that the conclusion be true in a large proportion of the models in which the relevant premises are true. More generally, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Australasian Journal of Logic

سال: 2017

ISSN: 1448-5052

DOI: 10.26686/ajl.v14i4.4050